Prism Trees: A Hierarchical Representation for 3-D Objects

نویسندگان

  • Olivier D. Faugeras
  • Jean Ponce
چکیده

fn t h i s paper we propose a new h i e r a r c h i c a l s t r u c t u r e fo r d e s c r i b i n g 5-0 o b j e c t s , c a l l e d the Prism Tree. This ternar> t ree s t r u c t u r e , i n s p i r e d from the p lanar S t r i p Tree, is b u i l t from an i n i t i a l t r i a n g u i a t i o n o f the ob jec t by us ing a po l yhed ra l approx imat ion a l g o r i t h m . D i f f e r e n t p r o p e r t i e s o f t h i s r e p r e s e n t a t i o n are shown, as we l l as a l go r i t hms fo r i n t e r s e c t i n g o b j e c t s and neighbor f i n d i n g t echn iques .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Judging similarity among strings described by hierarchical trees.

The paper compares the tree-theoretical model of similarity judgement (in which the similarity between two objects is a function of the distance between them in a conceptual tree) with an averaging model of similarity judgement that is drawn jointly from information integration theory and from current research indicating the prevalence of anchoring and adjustment mechanisms in judgement. Result...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Bit-Plane Decomposition Steganography Using Wavelet Compressed Video

This paper presents a steganography method using lossy compressed video which provides a natural way to send a large amount of secret data. The proposed method is based on 3-D set partitioning in hierarchical trees (SPIHT) algorithm for video compression and bit-plane complexity segmentation (BPCS) steganography. In 3-D SPIHT coding, wavelet coefficients in 3-D discrete wavelet transformed vide...

متن کامل

EMISSION-LINE OBJECTS FROM A PRELIMINARY UKST OBJECTIVE PRISM SURVEY

A visual search has been made of four fields using United Kingdom 1.2m Schmidt Objective Prism plates with a reciprocal dispersion of 1 180 A/mm at HP. Such plate material is ideally suited to searches for emission-line galaxies. We present a catalogue of 53 emission-line objects, which comprises 45 galaxies, where individual HI1 regions are resolved in 16 bright galaxies; 8 are emission li...

متن کامل

Progressive Video Coding for Noisy Channels

We extend the work of Sherwood and Zeger [1, 2] to progressive video coding for noisy channels. By utilizing a three-dimensional (3-D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm [3], we cascade the resulting 3-D SPIHT video coder [4, 5] with the ratecompatible punctured convolutional (RCPC) channel coder [6] for transmission of video over a binary symmetric channe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1983